ensembl member select multi dobject optim graph proposition random forest improv fusion dimension reduct method nearest neighbor classif uncertain chemic thermal data predict product qualiti cast process extend nearest neighbor classif sphere confid calibr random forest number supervis learn method introduc decad comprehens empir evalu supervis learn statlog project earli present larg scale empir comparison ten supervis learn method svm neural net logist regress naiv bay memori base learn random forest decis tree bag tree boost tree boost stump examin effect calibr model platt scale isoton regress perform import aspect studi varieti perform criteria evalu learn method accuraci divers measur evalu select ensembl classifi comprehens model predict molecular interact heart dregul gene problem rank ensembl base train valid perform main purpos studi determin result train valid data estim ensembl perform data specif setup evalu ensembl built pool independ train neural network target divers implicitli answer resound experiment uci dataset show gener gain perform data choos ensembl base train measur evalu fact measur evalu includ frequent ensembl train valid accuraci base classifi train valid accuraci ensembl train valid auc divers measur main reason ensembl tend similar perform deliber lower accuraci base classifi kei consequ data miner pick ensembl random addit result futil algorithm aim optim ensembl perform select subset base classifi chipper algorithm concept descript background knowledg graph base learn case studi chemoinformat maxim area roc curv decis list rule set learn classifi structur data graph proposition reduc high ddimension data princip compon analysi random project nearest neighbor classif resolv rule conflict doubl induct resolv rule conflict doubl induct classif intersect rule rule induct scheme gener hypothes form unord rule set import problem address classifi exampl hypothes deal overlap rule predict class previou approach problem calcul class probabl base union exampl cover overlap rule cn assum rule independ naiv bay demonstr signific improv accuraci obtain class probabl calcul base intersect overlap rule case empti intersect base intersect region rule induct classif gene express arrai data learn recogn brain specif protein base low dlevel featur dline predict server learn recogn brain specif protein base low dlevel featur dline predict server automat keyword extract domain knowledg document assign keyword frequenc analysi term found document text arguabl primari sourc knowledg document includ hierarch organis domain specif thesauru knowledg sourc qualiti keyword improv consider measur match previous manual assign keyword classifi uncov exampl rule stretch paper concern classifi exampl cover rule unord hypothesi assign major class uncov exampl standard method method present minim generalis rule includ uncov exampl method call rule stretch evalu domain induct logic program system virtual predict induct base hypothesi result show signic improv standard method boost interv base liter supervis classif method time seri multivari present base boost simpl classifi claus liter bodi background predic base tempor interv type predic rel predic increas stai ii region predic oper region domain variabl experi data set obtain uci ml kdd repositori show propos method highli competit previou approach learn order logic time seri classifi departamento de inform atica combin divid dand dconquer separ dand dconquer effici effect rule induct divid conquer dac separ conquer sac strategi rule induct extens search rule dac maxim conserv decis made search previou rule result effici strategi suffer difficulti effect induc disjunct concept due replic problem sac hand maxim liber respect larger hypothesi space search case avoid replic problem cost lower effici present hybrid strategi call reconsid conquer rac handl replic problem effect dac reconsid earlier decis effici induct sac hold decis present experiment result proposit numer relat domain demonstr rac si learn order logic time seri classifi rule boost departamento de inform atica combin divid dand dconquer separ dand dconquer effici effect rule induct divid conquer dac separ conquer sac strategi rule induct extens search rule dac maxim conserv decis made search previou rule result effici strategi suffer difficulti effect induc disjunct concept due replic problem sac hand maxim liber respect larger hypothesi space search case avoid replic problem cost lower effici present hybrid strategi call reconsid conquer rac handl replic problem effect dac reconsid earlier decis effici induct sac hold decis present experiment result proposit numer relat domain demonstr rac si induct logic program dguid unfold resolut specialis oper approach top induct logic program oper overli gener hypothesi declar bia restrict predic symbol produc hypothes predic invok main strategi topdown induct logic program cover divid conquer formalis resolut specialis oper result strategi perform guid unfold strategi compar theoret experiment shown comput cost grow quadrat size set cover grow linearli divid conquer demonstr experi amount ofwork perform cover time amount ofwork perform divideand conquer theoret analysi show hypothesi space larger cover compact hypothes found techniqu divid conquer shown recurs hypothesi produc cover equival hypothesi background predic produc divid conquer major draw back divid conquer contrast cover applic learn recurs de nition induct recurs transfer rule transfer rule bi lingual translat system transfer logic represent sourc languag sentenc logic represent target languag sentenc work studi induct transfer rule exampl pair sourc target quasi logic formula qlf main featur problem rule needtobeproducedfromasingl ii posit exampl provid iii produc hypothesi recurs earlier studi problem system propos hand code heurist emploi identifi recurs correspond work studi case recurs transfer rule system heurist result preliminari experi english french qlf present demonstr inform su cient gener gener applic rule transfer previous unseen sourc target qlf experi show system su er produc overli speci rule problem disallow deriv target qlf correct consid potenti approach problem discuss induct logic program dguid unfold resolut specialis oper approach top induct logic program oper overli gener hypothesi declar bia restrict predic symbol produc hypothes predic invok main strategi topdown induct logic program cover divid conquer formalis resolut specialis oper result strategi perform guid unfold strategi compar theoret experiment shown comput cost grow quadrat size set cover grow linearli divid conquer demonstr experi amount ofwork perform cover time amount ofwork perform divideand conquer theoret analysi show hypothesi space larger cover compact hypothes found techniqu divid conquer shown recurs hypothesi produc cover equival hypothesi background predic produc divid conquer major draw back divid conquer contrast cover applic learn recurs de nition predic invent learn posit exampl abstract previou bia shift approach predic invent applic learn posit exampl complet hypothesi found languag neg exampl requir determin predic invent approach problem present merlin successor system predic invent guid sequenc input claus sld refut posit neg exampl overli gener theori contrast predecessor search minim nite state automaton gener posit neg sequenc merlin techniqu induc hidden markov modelsfrom posit sequenc enabl system invent predic trigger neg exampl advantag induct techniqu increment learn experiment result present compar merlin posit learn framework progol compar origin induct techniqu version produc determinist hidden markov model result show predic invent learn posit exampl bene cial induc model determinist imput interact learn tool base program special integr algorithm debug unfold transform interact learner theori dguide induct logic program infer regular languag jigsaw puzzl ruth spectr extend abstract special recurs predic semant programm intent satisfi find version satisfi approach propos approach correct overli gener program posit exampl exploit program synthesi techniqu synthes program special origin contrast previou approach logic program special neg exampl input discov algorithm special process perform posit exampl method refin logic program special version propos result propos approach correct overli gener program posit exampl show posit exampl induc finit state machin success sequenc model correct program fail sequenc exploit theorem prove produc counter exampl model check compos substitut induc fail sequenc conclus contribut studi specif predic special overli gener logic program kei word program special theorem prove posit neg exampl fold unfold rule finit state machin cover divid dand dconquer top ddown induct logic program cover divid conquer wellestablish search techniqu top induct proposit theori top induct logic program cover formal extens work divid conquer techniqu formal compar cover techniqu logic program framework cover work repeatedli special overli gener hypothesi iter focus find claus high coverag posit exampl divid conquer work special overli gener hypothesi focus discrimin posit neg exampl experiment result present demonstr case accur hypothes found divideand conquer cover cover consid altern repeatedli effici divideand conquer consid improv dguid unfold optim horn claus logic program mode analysi explan dbase learn partial evalu gener order goal approach gener number 